A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
نویسندگان
چکیده
An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to find an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best known algorithm takes time O(nT/4o~/I'd'~) for any plane graph of n vertices.
منابع مشابه
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs
A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, c...
متن کاملEfficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کاملA Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract)
An orthogonal drawing of a plane graph $G$ is a drawing of $G$ with the given planar embedding in which each vertex is mapped to a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edges do not cross except at their common end. Observe that only a planar graph with the maximum degree four or less has an orthogonal drawing. The best known alg...
متن کاملBend-Minimum Orthogonal Drawings of Plane 3-Graphs
In an orthogonal drawing of a plane graph, any edge is drawn as a sequence of line segments, each having either a horizontal or a vertical direction. A bend is a point where an edge changes its direction. A drawing is called a bend-minimum orthogonal drawing if the number of bends is minimum among all orthogonal drawings. This paper presents a linear-time algorithm to find a bend-minimum orthog...
متن کاملHigher-Degree Orthogonal Graph Drawing with Flexibility Constraints
Much work on orthogonal graph drawing has focused on 4-planar graphs, that is planar graphs where all vertices have maximum degree 4. In this work, we study aspects of the Kandinsky model, which is a model for orthogonal graph drawings of higher-degree graphs. First, we examine the decision problem β-Embeddability, which asks whether for a given planar graph with a fixed or variable embedding, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997